class Solution3 {
    public int searchInsert(int[] nums, int target) {
        if(nums[nums.length-1] < target) return nums.length;
        int left = 0,right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) {
                left = mid + 1;
            }else {
                right = mid;
            }
        } 
        return left;
    }
}